The Application of Sparse Supernodal Factorization Algorithms for Structurally Symmetric Linear Systems in Semiconductor Device Simulation
نویسنده
چکیده
It is well known that the solution of sparse linear systems, generally expressed in the form Ax = b, is a core task of numerical simulation. In case of semiconductor device simulation the coefficient matrix A is unsymmetric, but structurally symmetric ([2]). The solution of linear systems can be achieved by iterative or direct methods. While iterative methods do not always lead to a solution due to matrix conditions, direct methods usually consume more time and memory.
منابع مشابه
WZ factorization via Abay-Broyden-Spedicato algorithms
Classes of Abaffy-Broyden-Spedicato (ABS) methods have been introduced for solving linear systems of equations. The algorithms are powerful methods for developing matrix factorizations and many fundamental numerical linear algebra processes. Here, we show how to apply the ABS algorithms to devise algorithms to compute the WZ and ZW factorizations of a nonsingular matrix as well as...
متن کاملSupernodal Symbolic Cholesky Factorization on a Local-Memory Multiprocessor
In this paper, we consider the symbolic factorization step in computing the Cholesky factorization of a sparse symmetric positive definite matrix on distributedmemory multiprocessor systems. By exploiting the supernodal structure in the Cholesky factor, the performance of a previous parallel symbolic factorization algorithm is improved. Empirical tests demonstrate that there can be drastic redu...
متن کاملEfficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
We investigate the effect of load balancing when performing Cholesky factorization on a massively parallel SIMD computer. In particular we describe a supernodal algorithm for performing sparse Cholesky factorization. The way the matrix is mapped onto the processors has significant effect on its efficiency. We show that this assignment problem can be modeled as a graph coloring problem in a weig...
متن کاملAn Efficient Solver for Sparse Linear Systems Based on Rank-Structured Cholesky Factorization
Direct factorization methods for the solution of large, sparse linear systems that arise from PDE discretizations are robust, but typically show poor time and memory scalability for large systems. In this paper, we describe an efficient sparse, rank-structured Cholesky algorithm for solution of the positive definite linear system Ax = b when A comes from a discretized partial-differential equat...
متن کاملQuantitative Methods Inquires 179 IMPROVING THE PERFORMANCE OF SPARSE LU MATRIX FACTORIZATION USING A SUPERNODAL ALGORITHM
In this paper we investigate a method to improve the performance of sparse LU matrix factorization used to solve unsymmetric linear systems, which appear in many mathematical models. We introduced and used the concept of the supernode for unsymmetric matrices in order to use dense matrix operations to perform the LU factorization for sparse matrices. We describe an algorithm that uses supernode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007